1341B - Nastya and Door - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
int n,k;
int t;
const int N = 2e5 + 10;
int a[N];
int b[N];
int main()
{
	cin >> t;
	while(t --)
	{
		int j = 0;
		int ans = 0,sum,l;
		memset(b,0,sizeof(b));
		cin >> n >> k;
		for(int i = 1;i <= n;i ++)
		cin >> a[i];
		for(int i = 2;i < n;i ++)
		{
			if(a[i] > a[i - 1] && a[i] > a[i + 1])
			b[i] = 1;//在i点为山顶
			b[i] += b[i - 1];// 
		}
		for(int i = 1;i + k - 1 <= n;i ++)
		{
			sum = b[i + k - 2] - b[i] + 1;
			if(sum > ans)
			{
				ans = sum;
				l = i;
			}
		}
		cout << ans << " " << l << endl;
	}
}